Time-extraction for temporal logic-logic programming and local process time

Time and Modality in Avicennan Logic

Time window temporal logic

This paper introduces time window temporal logic (TWTL), a rich expressivity language for describing various time bounded specifications. In particular, the syntax and semantics of TWTL enable the compact representation of serial tasks, which are typically seen in robotics and control applications. This paper also discusses the relaxation of TWTL formulae with respect to deadlines of tasks. Eff...

Polynomial-Time Learning in Logic Programming and Constraint Logic Programming

Induction in rst-order logic languages suuers from an additional factor of complexity compared to induction in attribute-value languages: the number of possible matchings between a candidate hypothesis and a training example. This paper investigates the use of a stochastic bias to control this factor of complexity: the exhaustive exploration of the matching space is replaced by considering a xe...

Dealing with Multiple Granularity of Time in Temporal Logic Programming

Chronolog(MC) is an extension of logic programming based on a clocked temporal logic (CT L), a linear-time temporal logic with multiple granularity of time. A Chronolog(MC) program consists of a clock deenition, a clock assignment and a program body, and each predicate symbol appearing in the program body is associated with a local clock through the clock deenition and assignment. This paper in...

Graded Alternating-Time Temporal Logic

Recently, graded modalities have been added to the semantics of two of the logics most commonly used by the computer science community: μ-calculus, in [KSV02], and Ctl in [FNP08]. In both these settings, graded modalities enrich the universal and existential quantifiers with the capability to express the concept of at least k or all but k, for a non-negative integer k. Both μ-calculus and Ctl n...